Scalable Parallel Matrix Multiplication Algorithms with Application to a Maximum Entropy Problem
نویسنده
چکیده
This paper presents some e cient and scalable parallel and distributed implementations of a matrix multiplication operation, ADA0, where A is a very \fat" matrix, D a diagonal matrix and A0 is the transpose of A, a very \thin" matrix, and their application to a maximum entropy problem. Theoretical performance results of a time-optimal implementation and a space-optimal implementation are given in the IBM supercomputer SP2 environment.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملScalable parallelization of dynamic algorithms using the Chunks and Tasks programming model
We describe how the Chunks and Tasks programming model can be used for efficient parallelization of computations. In the Chunks and Tasks model there is no message passing, instead the application programmer specifies how to divide the work into small pieces (tasks) that can be executed in parallel. Abstractions for data (chunks) are also provided. The application programmer need not worry abou...
متن کاملFast and Scalable Parallel Algorithms for Matrix Chain Product and Matrix Powers on Reconfigurable Pipelined Optical Buses
Given N matrices A1, A2, ..., AN of size N × N, the matrix chain product problem is to compute A1 × A2 × ...× AN. Given an N × N matrix A, the matrix powers problem is to calculate the first N powers of A, i.e., A, A, A, ..., A. Both problems are important in conducting many matrix manipulations such as computing the characteristic polynomial, determinant, rank, and inverse of a matrix, and in ...
متن کاملFast matrix multiplication techniques based on the Adleman-Lipton model
Abstract. On distributed memory electronic computers, the implementation and association of fast parallel matrix multiplication algorithms has yielded astounding results and insights. In this discourse, we use the tools of molecular biology to demonstrate the theoretical encoding of Strassen’s fast matrix multiplication algorithm with DNA based on an n-moduli set in the residue number system, t...
متن کاملModeling of the Maximum Entropy Problem as an Optimal Control Problem and its Application to Pdf Estimation of Electricity Price
In this paper, the continuous optimal control theory is used to model and solve the maximum entropy problem for a continuous random variable. The maximum entropy principle provides a method to obtain least-biased probability density function (Pdf) estimation. In this paper, to find a closed form solution for the maximum entropy problem with any number of moment constraints, the entropy is consi...
متن کامل